Open Problems of the Lorentz Workshop “Enumeration Algorithms using Structure”
نویسندگان
چکیده
This is a collection of open problems presented at the Lorentz Workshop “Enumeration Algorithms using Structure” which took place at the Lorentz Center of the University of Leiden (The Netherlands), August 24 30, 2015. The workshop brought together researchers interested in various aspects of enumeration algorithms; in particular classical output-sensitive enumeration including output-polynomial and polynomial delay algorithms and the inputsensitive enumeration mainly dealing with exact exponential time enumeration algorithms and combinatorial bounds.
منابع مشابه
مقایسه و تحلیلی بر استفاده از الگوریتم های فراابتکاری برای حل مسائل زمانبندی تولید کارگاهی
One of the most important problems in research and applied fields of production management is a suitable scheduling for different operations. So, there are many approaches for job workshop or job non-workshop scheduling problems. Since job workshop scheduling problems (JSP) belong to NP-Hard class, some metaheuristics methods such as Tabu Search, Simulated Annealing, Genetic Algorithm and Parti...
متن کاملOPTIMIZATION OF AN OFFSHORE JACKET-TYPE STRUCTURE USING META-HEURISTIC ALGORITHMS
Offshore jacket-type towers are steel structures designed and constructed in marine environments for various purposes such as oil exploration and exploitation units, oceanographic research, and undersea testing. In this paper a newly developed meta-heuristic algorithm, namely Cyclical Parthenogenesis Algorithm (CPA), is utilized for sizing optimization of a jacket-type offshore structure. The a...
متن کاملFrom the Lorentz Transformation Group in Pseudo-Euclidean Spaces to Bi-gyrogroups
The Lorentz transformation of order $(m=1,n)$, $ninNb$, is the well-known Lorentz transformation of special relativity theory. It is a transformation of time-space coordinates of the pseudo-Euclidean space $Rb^{m=1,n}$ of one time dimension and $n$ space dimensions ($n=3$ in physical applications). A Lorentz transformation without rotations is called a {it boost}. Commonly, the ...
متن کاملEnumeration of Matchings: Problems and Progress
This document is built around a list of thirty-two problems in enumeration of matchings, the first twenty of which were presented in a lecture at MSRI in the fall of 1996. I begin with a capsule history of the topic of enumeration of matchings. The twenty original problems, with commentary, comprise the bulk of the article. I give an account of the progress that has been made on these problems ...
متن کاملExact algorithms for solving a bi-level location–allocation problem considering customer preferences
The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonlinear model presented in the literature considering customer preferences is linearized. Customer behavior ...
متن کامل